Genetic Programming, Indexed Memory, the Halting Problem, and Other Curiosities
نویسنده
چکیده
The genetic programming (GP) paradigm was designed to evolve functions that are progressively better approximations to some target function. The introduction of memory into GP has opened the Pandora's box which is algorithms. It has been shown that the combination of GP and Indexed Memory can be used to evolve any target algorithm. What has not been shown is the practicality of doing so. This paper addresses some of the fundamental issues in the process of evolving algorithms and proposes a variety of partial solutions, in general and for GP in particular.
منابع مشابه
The Halting Probability in Von Neumann Architectures
Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved for an idealised machine, are tested on a small T7 computer with (finite) memory, conditional branches and jumps. Simulations confirm Turing complete fitness landscapes of this type hold at most a vanishingly small fraction of u...
متن کاملIndexed Memory as a Generic Protocol for Handling Vectors of Data in Genetic Programming
Indexed memory is used as a generic protocol for handling vectors of data in genetic programming. Using this simple method, a single program can generate many outputs. It eliminates the complexity of maintaining different trees for each desired parameter and avoids problem-specific function calls for handling the vectors. This allows a single set of programming language primitives applicable to...
متن کاملThe project portfolio selection and scheduling problem: mathematical model and algorithms
This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملTuring Completeness in the Language of Genetic Programming with Indexed Memory
Genetic Programming is a method for evolving functions that find approximate or exact solutions to problems. There are many problems that traditional Genetic Programming (GP) cannot solve, due to the theoretical limitations of its paradigm. A Turing machine (TM) is a theoretical abstraction that express the extent of the computational power of algorithms. Any system that is Turing complete is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007